#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#define REP(i,n) for(int i=0;i<int(n);++i)

using namespace std;

int a[10010];
const int inf = 1<<29;

int main()
{
	int n,m,k;
	while(cin>>n>>m>>k)
	{
		int ans = inf;
		REP(i,n) cin>>a[i];
		if((n&1^1)||n/2+1>m) ans = 0;
		else
		{
			int mint = inf;
			REP(i,n)
			{
				mint = min(mint,a[i++]);
			}
			long long kt = 1ll*m/(n/2+1)*k;
			ans = min(1ll*mint,kt);
		}
		cout<<ans<<endl;
	}
	return 0;
}
